471 research outputs found

    A Partial Read Barrier for Efficient Support of Live Object-oriented Programming

    Get PDF
    International audienceLive programming, originally introduced by Smalltalk and Lisp, and now gaining popularity in contemporary systems such as Swift, requires on-the-fly support for object schema migration, such that the layout of objects may be changed while the program is at one and the same time being run and developed. In Smalltalk schema migration is supported by two primitives, one that answers a collection of all instances of a class, and one that exchanges the identities of pairs of objects, called the become primitive. Existing instances are collected, copies using the new schema created, state copied from old to new, and the two exchanged with become, effecting the schema migration. Historically the implementation of become has either required an extra level of indirection between an object's address and its body, slowing down slot access, or has required a sweep of all objects, a very slow operation on large heaps. Spur, a new object representation and memory manager for Smalltalk-like languages, has neither of these deficiencies. It uses direct pointers but still provides a fast become operation in large heaps, thanks to forwarding objects that when read conceptually answer another object and a partial read barrier that avoids the cost of explicitly checking for forwarding objects on the vast majority of object accesses

    Transcriptional Silencing of Multiple Genes in Trophozoites of Entamoeba histolytica

    Get PDF
    In a previous work we described the transcriptional silencing of the amoebapore A (AP-A) gene (Ehap-a) of Entamoeba histolytica strain HM-1:IMSS. The silencing occurred following transfection with a plasmid containing a 5′ upstream region (473 bp) of Ehap-a that included a truncated segment (140 bp) of a short interspersed nuclear element (SINE1). Silencing remained in effect even after removal of the plasmid (clone G3). Neither short interfering RNA nor methylated DNA were detected, but the chromatin domain of Ehap-a in the gene-silenced trophozoites was modified. Two other similar genes (Ehap-b and one encoding a Saposin-like protein, SAPLIP 1) also became silenced. In the present work we demonstrate the silencing of a second gene of choice, one that encodes the light subunit of the Gal/GalNAc inhibitable lectin (Ehlgl1) and the other, the cysteine proteinase 5 (EhCP-5). This silencing occurred in G3 trophozoites transfected with a plasmid in which the 473 bp 5′ upstream Ehap-a fragment was directly ligated to the second gene. Transcriptional silencing occurred in both the transgene and the chromosomal gene. SINE1 sequences were essential, as was a direct connection between the Ehap-a upstream region and the beginning of the open reading frame of the second gene. Gene silencing did not occur in strain HM-1:IMSS with any of these plasmid constructs. The trophozoites with two silenced genes were virulence-attenuated as were those of clone G3. In addition, trophozoites not expressing Lgl1 and AP-A proteins had a significantly reduced ability to cap the Gal/GalNAc-lectin to the uroid region when incubated with antibodies against the heavy (170 kDa) subunit of the lectin. Lysates of trophozoites lacking cysteine proteinase 5 and AP-A proteins had 30% less cysteine proteinase activity than those of HM-1:IMSS strain or the G3 clone. Silencing of other genes in G3 amoebae could provide a model to study their various functions. In addition, double gene-silenced, virulence-attenuated trophozoites may be an important tool in vaccine development

    Memory consolidation in the cerebellar cortex

    Get PDF
    Several forms of learning, including classical conditioning of the eyeblink, depend upon the cerebellum. In examining mechanisms of eyeblink conditioning in rabbits, reversible inactivations of the control circuitry have begun to dissociate aspects of cerebellar cortical and nuclear function in memory consolidation. It was previously shown that post-training cerebellar cortical, but not nuclear, inactivations with the GABA(A) agonist muscimol prevented consolidation but these findings left open the question as to how final memory storage was partitioned across cortical and nuclear levels. Memory consolidation might be essentially cortical and directly disturbed by actions of the muscimol, or it might be nuclear, and sensitive to the raised excitability of the nuclear neurons following the loss of cortical inhibition. To resolve this question, we simultaneously inactivated cerebellar cortical lobule HVI and the anterior interpositus nucleus of rabbits during the post-training period, so protecting the nuclei from disinhibitory effects of cortical inactivation. Consolidation was impaired by these simultaneous inactivations. Because direct application of muscimol to the nuclei alone has no impact upon consolidation, we can conclude that post-training, consolidation processes and memory storage for eyeblink conditioning have critical cerebellar cortical components. The findings are consistent with a recent model that suggests the distribution of learning-related plasticity across cortical and nuclear levels is task-dependent. There can be transfer to nuclear or brainstem levels for control of high-frequency responses but learning with lower frequency response components, such as in eyeblink conditioning, remains mainly dependent upon cortical memory storage

    Asynchronous Byzantine Agreement with Subquadratic Communication

    Get PDF
    Understanding the communication complexity of Byzantine agreement (BA) is a fundamental problem in distributed computing. In particular, as protocols are run with a large number of parties (as, e.g., in the context of blockchain protocols), it is important to understand the dependence of the communication on the number of parties nn. Although adaptively secure BA protocols with o(n2)o(n^2) communication are known in the synchronous and partially synchronous settings, no such protocols are known in the fully asynchronous case. We show here an asynchronous BA protocol with subquadratic communication tolerating an adaptive adversary who can corrupt f0f0). One variant of our protocol assumes initial setup done by a trusted dealer, after which an unbounded number of BA executions can be run; alternately, we can achieve subquadratic amortized communication with no prior setup. We also show that some form of setup is needed for (non-amortized) subquadratic BA tolerating Θ(n)\Theta(n) corrupted parties. As a contribution of independent interest, we show a secure-computation protocol in the same threat model that has o(n2)o(n^2) communication when computing no-input functionalities with short output (e.g., coin tossing)

    Chai: Traits for Java-Like Languages

    Full text link
    corecore